A simple algorithm for decoding both errors and erasures of Reed-Solomon codes
نویسنده
چکیده
A simple algorithm for decoding both errors and erasures of ReedSolomon codes is described.
منابع مشابه
Efficient algorithms for decoding Reed-Solomon codes with erasures
In this paper, we present a new algorithm for decoding Reed-Solomon codes with both errors and erasures. The algorithm combines an efficient method for solving the Key Equation and a technique which separates the error locator polynomial from the erasure locator polynomial. The new algorithm is compared to two other efficient Reed-Solomon decoding algorithms and shown to be significantly faster...
متن کاملInversionless decoding of both errors and erasures of Reed-Solomon code
Recently, the authors [1] proposed an inversefree Berlekamp–Massey (BM) algorithm to simplify the Reed–Solomon (RS) codes. This modified RS decoding method is the best known technique for finding the error locator polynomial. In this letter the inverse-free method is generalized to find both errors and erasures. The basic idea of the new procedure is the replacement of the initial condition of ...
متن کاملG. Richter and S. Plass: Error and Erasure Decoding of Rank-Codes with a Modified Berlekamp-Massey Algorithm, in Proc. of ITG Conference on Source
This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique ...
متن کاملA Simplified Procedure for Correcting Both Errors and Erasures of a Reed-Solomon Code Using the Euclidean Algorithm
It is well known that the Euclidean algorithm or its equivalent, continued fractions, can be used to find the error locator polynomial and the error evaluator polynomial in Berlekamp ’s key equation needed to decode a Reed-Solomon (RS) code. In this article, a simplified procedure is developed and proved. to correct erasures as well as errors by replacing the initial condition of the Euclidean ...
متن کاملFast Transform for Decoding Both Errors and Erasures of Reed – Solomon Codes Over GF ( 2 m ) for 8 m 10
In this letter, it is shown that a fast, prime-factor discrete Fourier transform (DFT) algorithm can be modified to compute Fourier-like transforms of long sequences of 2 1 points over GF(2 ), where 8 10. Using these transforms, together with the Berlekamp–Massey algorithm, the complexity of the transform-domain decoder for correcting both errors and erasures of the Reed–Solomon codes of block ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/0904.2861 شماره
صفحات -
تاریخ انتشار 2008